منابع مشابه
Simple quantum error-correcting codes.
Methods of finding good quantum error correcting codes are discussed, and many example codes are presented. The recipe C⊥ 2 ⊆ C1, where C1 and C2 are classical codes, is used to obtain codes for up to 16 information qubits with correction of small numbers of errors. The results are tabulated. More efficient codes are obtained by allowing C1 to have reduced distance, and introducing sign changes...
متن کاملQuantum Error Correcting Codes
This thesis deals with quantum error correcting codes. In first two chapters necessary introduction to quantum computation and classical error correction is presented. Previous results on construction of quantum error correcting codes are presented in the third and fourth chapter. Mainly Calderbank-Steane-Shor (CSS) codes and stabilizer codes are discussed together with the introduction to codi...
متن کاملQuantum Error-correcting Codes
These notes are a record of proceedings in the QMW Combinat-orics Study Group in November and December 1998. Since we are discrete mathematicians and know little quantum theory, the notes are not strong on the physics background (but we give references to several sources for this). We have tried to compare quantum with classical error correction where possible, and to provide enough information...
متن کاملQuantum Error-Correcting Codes
Markus GRASSL received his diploma degree in Computer Science in 1994 and his doctoral degree in 2001, both from the Fakultät für Informatik, Universität Karlsruhe (TH), Germany. From 1994 to 2007 he was a member of the Institut für Algorithmen und Kognitive Systeme, Fakultät für Informatik, Universität Karlsruhe (TH), Germany. From 2007 to 2008 he was with the Institute for Quantum Optics and ...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 1996
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.54.4741